Models of String Pattern Matching
نویسنده
چکیده
1. Introduction In an earlier report [1], a model for string pattern matching in the style of SNOBOL4 was developed using Icon. That report showed how most of the pattern-matching mechanism of SNOBOL4 could be translated into Icon and, in effect, provided a model for implementing pattern matching in the style of SNOBOL4.
منابع مشابه
Analytic Approach to Pattern Matching
7.0 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 327 7.1 Probabilistic models . . . . . . . . . . . . . . . . . . . . . . . . . 330 7.2 Exact string matching . . . . . . . . . . . . . . . . . . . . . . . . 333 7.2.1 Languages representations . . . . . . . . . . . . . . . . . 334 7.2.2 Generating functions . . . . . . . . . . . . . . . . . . . . 337 7.2.3 Moments and li...
متن کاملParallel String Matching with Multi Core Processors-A Comparative Study for Gene Sequences
The increase in huge amount of data is seen clearly in present days because of requirement for storing more information. To extract certain data from this large database is a very difficult task, including text processing, information retrieval, text mining, pattern recognition and DNA sequencing. So we need concurrent events and high performance computing models for extracting the data. This w...
متن کاملApproximately Matching Context - Free
Given a string w and a pattern p, approximate pattern matching merges traditional sequence comparison and pattern matching by asking for the minimum diierence between w and a string exactly matched by p. We give an O(PN 2 (N + logP)) algorithm for approximately matching a string of length N and a context-free language speciied by a grammar of size P. The algorithm generalizes the Cocke-Younger-...
متن کاملW-Period Technique for Parallel String Matching
In this paper, we present new approach for parallel string matching. Some known parallel string matching algorithms are considered based on duels by witness which focuses on the strengths and weaknesses of the currently known methods. This has applications such as string databases, Information Retrieval and computational biology. The new ‘divide and conquer’ approach has been introduced for par...
متن کاملString Matching and its Applications in Diversified Fields
String searching algorithms, sometimes called string matching algorithms, are an important class of string algorithms that try to find a place where one or several strings (also called patterns) are found within a larger string or text.[11] String matching is a classical problem in computer science. In this paper we are trying to explore the various diversified fields where string matching has ...
متن کامل